2006 Coupling from the Past

نویسنده

  • Eric Vigoda
چکیده

We saw in the last lecture how Markov chains can be useful algorithmically. If we have a probability distribution we’d like to generate random samples from, we design an ergodic Markov chain whose unique stationary distribution is the desired distribution. We then run the chain (i.e., start at an arbitrary state and evolve according to the transition matrix), until the process is at (or close to) the stationary distribution.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

بکارگیری مدل های مختلف کوپل شدگی سیال - جسم برای بررسی مشخصه های ارتعاشی در ناحیه قفل شدگی

In this paper, several models of structure-fluid coupling are employed to investigate on the vibration behavior of the structure. Using basic equations of vibration and employing a mathematical model, a single degree of freedom system is analyzed. Some parameters of the mathematical model are obtained from test. To examine structure-flow interaction, coupled system of nonlinear second-order dif...

متن کامل

Fast perfect sampling from linear extensions

In this paper, we study the problem of sampling (exactly) uniformly from the set of linear extensions of an arbitrary partial order. Previous Markov chain techniques have yielded algorithms that generate approximately uniform samples. Here, we create a bounding chain for one such Markov chain, and by using a non-Markovian coupling together with a modified form of coupling from the past, we buil...

متن کامل

Combinatorial identities associated with CFTP

We explore a method of obtaining combinatorial identities by analysing partially-completed runs of the Coupling from the Past (CFTP) algorithm. In particular, using CFTP for simple symmetric random walk (ssrw) with holding boundaries, we derive an identity involving linear combinations of Cab(s) for different a and b, where Cab(s) is the probability that unconstrained ssrw run from 0 for time n...

متن کامل

Polynomial time perfect sampling algorithm for two-rowed contingency tables

This paper proposes a polynomial time perfect (exact) sampling algorithm for 2 × n contingency tables. The algorithm is based on monotone coupling from the past (monotone CFTP) algorithm. The expected running time is bounded by O(n lnN) where n is the number of columns and N is the total sum of all entries.

متن کامل

مطالعه عددی چگالی حالتها و رسانندگی الکترونی یک سیم مولکولی در حضور یک عامل خارجی

  There is a great interest in the electronic properties of conjugated polymers. Numerous works on the electronic and conduction properties of single-chain conjugated polymers have been published. From an electronic conduction point of view, these systems are quasi-one dimensional. The aim of this paper is to try to investigate corresponding properties in conducting polymers in higher of one-di...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006